The two-median problem on Manhattan meshes
نویسندگان
چکیده
منابع مشابه
The two-median problem on Manhattan meshes
We investigate the two-median problem on a mesh with M columns and N rows (M ≥ N ), under the Manhattan (L1) metric. We derive exact algorithms with respect to m, n, and r , the number of columns, rows, and vertices, respectively, that contain requests. Specifically, we give an O(mn2 logm) time, O(r ) space algorithm for general (nonuniform) meshes (assuming m≥n). For uniform meshes, we give tw...
متن کاملAn Algorithm for the Median Problem on Two Dimensional Meshes
We study the p median problem which is one the classical problems in location theory For p and on a two dimensional mesh we give an O mn p time algorithm for solving the problem where assuming that m n m is the number of rows of the mesh containing demand points n the number of columns containing demand points and p the number of demand points
متن کاملAn Algorithm for the 2-Median Problem on Two-Dimensional Meshes
We study the p-median problem which is one the classical problems in location theory. For p = 2 and on a two-dimensional mesh, we give an O(mn 2 p)-time algorithm for solving the problem, where, assuming that m n, m is the number of rows of the mesh containing demand points, n the number of columns containing demand points, and p the number of demand points.
متن کاملOn the DCJ Median Problem
As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data given at the leaves.When phrased as an optimization problem, this problem reduces to computing a median of three genomes under the operations (e...
متن کاملOn the Matrix Median Problem
The Genome Median Problem is an important problem in phylogenetic reconstruction under rearrangement models. It can be stated as follows: given three genomes, find a fourth that minimizes the sum of the pairwise rearrangement distances between it and the three input genomes. Recently, Feijão and Meidanis extended the algebraic theory for genome rearrangement to allow for linear chromosomes, thu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2007
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20156